Real-Time Scheduling on Dial-a-Ride Vehicle Service

On the Online Dial-A-Ride Problem with Time-Windows

In this paper the first results on the Online Dial-A-Ride Problem with Time-Windows (ODARPTW for short) are presented. Requests for rides appearing over time consist of two points in a metric space, a source and a destination. Servers transport objects of requests from sources to destinations. Each request specifies a deadline. If a request is not be served by its deadline, it will be called of...

Quality of service in dial-a-ride operations

Few studies have been conducted on the quality of service provided by the organizations responsible of providing dial-a-ride services for people with reduced mobility. In order to study quality in such contexts, the paper first defines what is meant by “quality” in the service sector. The difference between quality and satisfaction is then discussed, and the most well-known scales of measuremen...

Online Dial-a-Ride Problems: Minimizing the Completion Time

Revenue Maximization in Online Dial-A-Ride

We study a variation of the Online-Dial-a-Ride Problem where each request comes with not only a source, destination and release time, but also has an associated revenue. The server’s goal is to maximize its total revenue within a given time limit, T . We show that the competitive ratio is unbounded for any deterministic online algorithm for the problem. We then provide a 3-competitive algorithm...

A stochastic model for a vehicle in a dial-a-ride system

Weconsider a stochasticmodel for a systemwhich can serve n customers concurrently, and each accepted and departing customer generates a service interruption. The proposed model describes a single vehicle in a dial-a-ride transport system and is closely related to Erlang’s loss system. We give closed-form expressions for the blocking probability, the acceptance rate, and the mean sojourn time, w...